Optimal Path Discovery Problem with Homogeneous Knowledge
نویسندگان
چکیده
منابع مشابه
The Optimal Path-Matching Problem
We describe a common generalization of the weighted matching problem and the weighted matroid intersection problem. In this context we establish common generalizations of the main results on those two problems|polynomial-time solvability, min-max theorems, and totally dual integral polyhedral descriptions. New applications of these results include a strongly polynomial separation algorithm for ...
متن کاملMULTI-CRITERIA PATH PLANNING WITH TERRAIN VISIBILITY CONSTRAINTS The Optimal Searcher Path Problem with Visibility
How can search theory and path planning concepts be used to formulate and to solve detection search problems in the context of a ground SAR operation while taking into account practical aspects such as terrain visibility constraints? As an answer to this research question, we have formulated a novel detection search problem to include the searcher's visibility constraints (the Optimal Searcher ...
متن کاملWeighted Optimal Path in Graph with Multiple Indexes
This paper represents a technique for finding optimal paths with multiple indexes in a graph. Up to the present time, all optimal paths have been determined upon one index, say, distance for which an evaluation method exists. In this paper firstly we define multiple indexes for each edge in such a way that anyone can treat the factor for assigning an optimal path. Here, we use Data Envelopment ...
متن کاملShortest Path Problem with Gamma Probability Distribution Arc Length
We propose a dynamic program to find the shortest path in a network having gamma probability distributions as arc lengths. Two operators of sum and comparison need to be adapted for the proposed dynamic program. Convolution approach is used to sum two gamma probability distributions being employed in the dynamic program.
متن کاملConstraint Programming for Path Planning with Uncertainty - Solving the Optimal Search Path Problem
The optimal search path (OSP) problem is a single-sided detection search problem where the location and the detectability of a moving object are uncertain. A solution to this NP-hard problem is a path on a graph that maximizes the probability of finding an object that moves according to a known motion model. We developed constraint programming models to solve this probabilistic path planning pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2019
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-019-09928-w